Some Geometric and Combinatorial Properties of (0; M; 2)-nets in Base B 2
نویسنده
چکیده
In this paper, we study the geometric generation of the (0; m; 2)-nets. Based on some combinatorial methods, a generation property on (0; m; 2)-nets with an applications to a Sobol' sequence and the number of the (0; m; 2)-nets in equivalent sense are given. We also present some symmetry properties of the Sobol' sequence and the Roth-Zaremba sequence.
منابع مشابه
Nets, (t, S)-Sequences, and Algebraic Curves Over Finite Fields With Many Rational Points
Nets, (t; s)-sequences, and algebraic curves over nite elds with many rational points Nets and (t; s)-sequences are nite point sets, respectively innnite sequences, satisfying strong uniformity properties with regard to their distribution in the s-dimensional unit cube I s = 0; 1] s. The general theory of these com-binatorial objects was rst developed by the speaker 2], and they have attracted ...
متن کاملOn some remarkable properties of the two - dimensional Hammersley point set in base 2 par
We study a special class of (0,m, 2)-nets in base 2. In particular, we are concerned with the two-dimensional Hammersley net that plays a special role among these since we prove that it is the worst distributed with respect to the star discrepancy. By showing this, we also improve an existing upper bound for the star discrepancy of digital (0,m, 2)-nets over Z2. Moreover, we show that nets with...
متن کاملSome Algebraic and Combinatorial Properties of the Complete $T$-Partite Graphs
In this paper, we characterize the shellable complete $t$-partite graphs. We also show for these types of graphs the concepts vertex decomposable, shellable and sequentially Cohen-Macaulay are equivalent. Furthermore, we give a combinatorial condition for the Cohen-Macaulay complete $t$-partite graphs.
متن کاملScrambling Sobol' and Niederreiter-Xing Points
Hybrids of equidistribution and Monte Carlo methods of integration can achieve the superior accuracy of the former while allowing the simple error estimation methods of the latter. In particular randomized (0; m; s)-nets in base b produce unbiased estimates of the integral, have a variance that tends to zero faster than 1=n for any square integrable integrand, and have a variance that for nite ...
متن کاملLinear programming bounds for (T,M, S)-nets
of volume bT−M contains exactly b points of the net. (Note that V ol(E) = b− ∑ di .) These deterministic low-discrepancy point sets have proven powerful in the estimate of high-dimensional integrals. The goal is to make the quality parameter T as close to zero as possible. Some researchers work on constructions of such nets and ideas from coding theory have led to very powerful examples [7]. Bu...
متن کامل